Interacting generalized Friedman’s urn systems

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Generalized Pólya Urn Models

We study an urn model introduced in the paper of Chen and Wei [2], where at each discrete time step m balls are drawn at random from the urn containing colors white and black. Balls are added to the urn according to the inspected colors, generalizing the well known Pólya-Eggenberger urn model, case m = 1. We provide exact expressions for the expectation and the variance of the number of white b...

متن کامل

Generalized Pólya Urn Designs with Null Balance

In this paper we propose a class of sequential urn designs based on generalized Pólya urn (GPU) models for balancing the allocations of two treatments in sequential clinical trials. In particular, we consider a GPU model characterized by a 2× 2 random addition matrix with null balance (i.e. null row sums) and replacement rule depending upon the urn composition. Under this scheme, the urn proces...

متن کامل

A Generalized Urn Model in Clinical Trials

Urn models are very popular and useful for adaptive designs in clinical studies. Among various urn models, the drop-the-loser rule is an efficient adaptive treatment allocation scheme, recently proposed for comparing different treatments in clinical trials. This rule is superior to other randomization schemes in terms of variability and power. In this paper, the drop-the-loser rule is generaliz...

متن کامل

Generalized Urn Models of Evolutionary Processes

Generalized Polya urn models can describe the dynamics of finite populations of interacting genotypes. Three basic questions these models can address are: Under what conditions does a population exhibit growth? On the event of growth, at what rate does the population increase? What is the long term behavior of the distribution of genotypes? To address these questions, we associate a mean limit ...

متن کامل

Logical equivalence between generalized urn models and finite automata

To every generalized urn model there exists a finite (Mealy) automaton with identical propositional calculus. The converse is true as well.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Stochastic Processes and their Applications

سال: 2017

ISSN: 0304-4149

DOI: 10.1016/j.spa.2016.12.003